Median constrained bucket order rank aggregation
نویسندگان
چکیده
منابع مشابه
Rank Order Weighted Vector Median Filter
In this paper a novel adaptive noise attenuating and edge enhancing filter for color image processing is proposed. The new filtering design is based, like the vector median filter, on the minimization of aggregated weighted distances between pixels in a sliding filtering window. The weights which are assigned to the sequence of the sorted distances are decreasing functions of their ranks. In th...
متن کاملBayesian Aggregation of Order-Based Rank Data
Rank aggregation, that is, combining several ranking functions (called base rankers) to get aggregated, usually stronger rankings of a given set of items, is encountered in many disciplines. Most methods in the literature assume that base rankers of interest are equally reliable. It is very common in practice, however, that some rankers are more informative and reliable than others. It is desir...
متن کاملA Novel Distance-Based Approach to Constrained Rank Aggregation
We consider a classical problem in choice theory – vote aggregation – using novel distance measures between permutations that arise in several practical applications. The distance measures are derived through an axiomatic approach, taking into account various issues arising in voting with side constraints. The side constraints of interest include non-uniform relevance of the top and the bottom ...
متن کاملSync-Rank: Robust Ranking, Constrained Ranking and Rank Aggregation via Eigenvector and Semidefinite Programming Synchronization
Abstract. We consider the classic problem of establishing a statistical ranking of a set of n items given a set of inconsistent and incomplete pairwise comparisons between such items. Instantiations of this problem occur in numerous applications in data analysis (e.g., ranking teams in sports data), computer vision, and machine learning. We formulate the above problem of ranking with incomplete...
متن کاملLinear constrained reduced rank and polynomial order methods
The Subspace-based Reduced Rank and Polynomial Order (RRPO) methods were proposed recently [1, 2, 3], which estimate a reduced order linear prediction polynomial whose roots are the desired "signal roots". In this paper, we describe how to extend the RRPO methods to include constraints involving known signal information. Simulation results indicate that by incorporating known signal information...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Statistics
سال: 2019
ISSN: 0943-4062,1613-9658
DOI: 10.1007/s00180-018-0858-z